Gröbner Bases, H–bases and Interpolation
نویسنده
چکیده
The paper is concerned with a construction for H–bases of polynomial ideals without relying on term orders. The main ingredient is a homogeneous reduction algorithm which orthogonalizes leading terms instead of completely canceling them. This allows for an extension of Buchberger’s algorithm to construct these H–bases algorithmically. In addition, the close connection of this approach to minimal degree interpolation, and in particular to the least interpolation scheme due to de Boor and Ron, is pointed out.
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملQuadratic Gröbner bases for smooth 3 × 3 transportation polytopes
The toric ideals of 3 × 3 transportation polytopes Trc are quadratically generated. The only exception is the Birkhoff polytope B3. If Trc is not a multiple of B3, these ideals even have square-free quadratic initial ideals. This class contains all smooth 3 × 3 transportation polytopes.
متن کاملMATH536A Paper: Gröbner Bases
An introduction to Gröbner bases and some of their uses in affine algebraic geometry.
متن کاملMinimal generators from reduced Gröbner bases obtained by interpolation methods
In 1982 Buchberger and Möller described a polynomial algorithm to compute a reduced Gröbner basis of the ideal of affine points basing on interpolation methods. This algorithm was an incisive step for a worthwhile progress in computation of zero-dimensional schemes and their applications. The consequent generalization of the original algorithm of Buchberger and Möller to projective points gave ...
متن کاملSudan’s List Decoding of Reed-Solomon Codes from a Gröbner Basis Perspective
The interpolation step of Sudan’s list decoding of Reed-Solomon codes sets forth the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is presented based on the theory of Gröbner bases of modules. In a special case, this algorithm is shown to be equivalent with the Berlekamp-Massey algorithm for decodin...
متن کامل